“What if?” in Probabilistic Logic Programming

نویسندگان

چکیده

Abstract A ProbLog program is a logic with facts that only hold specified probability. In this contribution, we extend language by the ability to answer “What if” queries. Intuitively, defines distribution solving system of equations in terms mutually independent predefined Boolean random variables. theory causality, Judea Pearl proposes counterfactual reasoning for such systems equations. Based on Pearl’s calculus, provide procedure processing these queries programs, together proof correctness and full implementation. Using latter, insights into influence different parameters scalability inference. Finally, also show our approach consistent CP-logic, causal semantics programs annotated disjunctions.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deep Probabilistic Logic Programming

Probabilistic logic programming under the distribution semantics has been very useful in machine learning. However, inference is expensive so machine learning algorithms may turn out to be slow. In this paper we consider a restriction of the language called hierarchical PLP in which clauses and predicates are hierarchically organized. In this case the language becomes truth-functional and infer...

متن کامل

ProbLog2: Probabilistic Logic Programming

We present ProbLog2, the state of the art implementation of the probabilistic programming language ProbLog. The ProbLog language allows the user to intuitively build programs that do not only encode complex interactions between a large sets of heterogenous components but also the inherent uncertainties that are present in real-life situations. The system provides efficient algorithms for queryi...

متن کامل

Probabilistic Constraint Logic Programming

This paper addresses two central problems for probabilistic processing models: parameter estimation from incomplete data and efficient retrieval of most probable analyses. These questions have been answered satisfactorily only for probabilistic regular and context-free models. We address these problems for a more expressive probabilistic constraint logic programming model. We present a log-line...

متن کامل

Probabilistic Logic Programming

Of all scientiic investigations into reasoning with uncertainty and chance, probability theory is perhaps the best understood paradigm. Nevertheless, all studies conducted thus far into the semantics of quantitative logic programming(cf.) have restricted themselves to non-probabilistic semantical characterizations. In this paper, we take a few steps towards rectifying this situation. We deene a...

متن کامل

Probabilistic Inductive Logic Programming

The field of Probabilistic Logic Programming (PLP) has seen significant advances in the last 20 years, with many proposals for languages that combine probability with logic programming. Since the start, the problem of learning probabilistic logic programs has been the focus of much attention and a special issue of Theory and Practice of Logic Programming on Probability, Logic, and Learning has ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theory and Practice of Logic Programming

سال: 2023

ISSN: ['1471-0684', '1475-3081']

DOI: https://doi.org/10.1017/s1471068423000133